Petri Nets Semantics of P-calculus
نویسندگان
چکیده
As p-calculus based on the interleaving semantics cannot depict the true concurrency and has few supporting tools, it is translated into Petri nets. p-calculus is divided into basic elements, sequence, concurrency, choice and recursive modules. These modules are translated into Petri nets to construct a complicated system. Petri nets semantics for p-calculus visualize system structure as well as system behaviors. The structural analysis techniques allow direct qualitative analysis of the system properties on the structure of the nets. Finally, Petri nets semantics for p-calculus are illustrated by applying them to mobile telephone systems.
منابع مشابه
A Process Calculus for Expressing Finite Place/Transition Petri Nets
We introduce the process calculus Multi-CCS, which extends conservatively CCS with an operator of strong prefixing able to model atomic sequences of actions as well as multiparty synchronization. Multi-CCS is equipped with a labeled transition system semantics, which makes use of a minimal structural congruence. Multi-CCS is also equipped with an unsafe P/T Petri net semantics by means of a nov...
متن کاملA Petri Net Semantics for - Calculus ?
A distributed semantics for-calculus, based on P/T Petri nets with inhibitor arcs, is presented. This net semantics is sound w.r.t. the original early transition system semantics: the interleaving semantics of an agent p is retrievable from the net by considering the inter-leaving marking graph for the associated marking dec(p). Furthermore,-calculus is equipped with a multistep and a causal se...
متن کاملNon Sequential Semantics for Contextual P/T Nets
The problem of nding a true concurrent semantics for con-textual P/T nets has not been deeply studied yet. The interest for such a semantics has been renewed by some recent proposals to equip mobile process algebras with a net semantics based on this model. In 3] we proposed a causal semantics for such nets, in this paper we study the non sequential semantics of contextual P/T nets. The semanti...
متن کاملOn the Relationship between π-Calculus and Finite Place/Transition Petri Nets
We clarify the relationship between π-calculus and finite p/t Petri nets. The first insight is that the concurrency view to processes taken in [Eng96,AM02,BG09] and the structural view in [Mey09] are orthogonal. This allows us to define a new concurrency p/t net semantics that can be combined with the structural semantics in [Mey09]. The result is a more expressive mixed semantics, which transl...
متن کاملAn Operational Petri Net Semantics for the Join-Calculus
We present a concurrent operational Petri net semantics for the join-calculus, a process calculus for specifying concurrent and distributed systems. There often is a gap between system specifications and the actual implementations caused by synchrony assumptions on the specification side and asynchronously interacting components in implementations. The join-calculus is promising to reduce this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008